//2529.正整数和负整数的最大计数
//https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer/?envType=daily-question&envId=2024-04-09
class Solution {
public:
    int maximumCount(vector<int>& nums) {
        int pos = 0; //正数
        int neg = 0; //负数
        for(int& n:nums)
        {
            if(n > 0) ++pos;
            else if(n < 0) ++neg;
        }
        return max(pos,neg);
    }
};